Formal proof of prefix adders
نویسندگان
چکیده
منابع مشابه
Formal Proof for a General Architecture of Hybrid Prefix/Carry-Select Adders
In this paper, we present a general architecture of hybrid prefix/carry-select adder. Based on this architecture, we formalize the hybrid adder’s algorithm using the first-order recursive equations and develop a proof framework to prove its correctness. Since several previous adders in the literature are special cases of this general architecture, our methodology can be used to prove the correc...
متن کاملImplementation and Performance Evaluation of Prefix Adders uing FPGAs
Parallel Prefix Adders have been established as the most efficient circuits for binary addition. The binary adder is the critical element in most digital circuit designs including digital signal processors and microprocessor data path units. The final carry is generated ahead to the generation of the sum which leads extensive research focused on reduction in circuit complexity and power consump...
متن کاملNon-Heuristic Optimization and Synthesis of Parallel-Prefix Adders
The class of parallel-prefix adders comprises the most area-delay efficient adder architectures – such as the ripple-carry, the carry-increment, and the carry-lookahead adders – for the entire range of possible area-delay trade-offs. The generic description of these adders as prefix structures allows their simple and consistent area optimization and synthesis under given timing constraints, inc...
متن کاملDesign of High Speed 128 bit Parallel Prefix Adders
In this paper, we propose 128-bit Kogge-Stone, Ladner-Fischer, Spanning tree parallel prefix adders and compared with Ripple carry adder. In general N-bit adders like Ripple Carry Adders (slow adders compare to other adders), and Carry Look Ahead adders (area consuming adders) are used in earlier days. But now the most Industries are using parallel prefix adders because of their advantages comp...
متن کاملA Family of Parallel-Prefix Modulo 2 − 1 Adders
In this paper we at first reveal the cyclic nature of idempotency in the case of modulo 2n − 1 addition. Then based on this property, we derive for each n, a family of minimum logic depth modulo 2n − 1 adders, which allows several trade-offs between the number of operators, the internal wire length, and the fanout of internal nodes. Performance data, gathered using static CMOS implementations, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2010
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2010.02.008